3D point pattern matching based on spatial geometric flexibility

3D point pattern matching based on spatial geometric flexibility

We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises from marker based optical motion capture (Mocap) systems for facial Mocap data. To establish one-to-one identifications, we introduce a forward 3D point pattern matching (PPM) method based on spatial geometric flexib...

Pattern Matching for Spatial Point Sets

Two sets of points in -dimensional space are given: a data set consisting of points, and a pattern set or probe consisting of points. We address the problem of determining whether there is a transformation, among a specified group of transformations of the space, carrying into or near (meaning at a small directed Hausdorff distance of) . The groups we consider are translations and rigid motions...

Geometric Point Pattern Matching in the Knuth-Morris-Pratt Way

Given finite sets P and T of points in the Euclidean space R, the point pattern matching problem studied in this paper is to find all translations f ∈ R such that P + f ⊆ T . A fast search algorithm with some variants is presented for point patterns P that have regular grid–like geometric shape. The algorithm is analogous to the Knuth–Morris–Pratt algorithm of string matching. The time requirem...

Using k-d Trees for Robust 3D Point Pattern Matching

We propose a new method for matching two 3D point sets of identical cardinality with global similarity but locally non-rigid distribution. This problem arises from markerbased optical motion capture systems. The point-sets are extracted from similar design poses of two subjects with underlying non-rigidity and possible distribution discrepancies, one being a model set (manually identified) and ...

Pattern Matching of Colored Point Sets in 3d